Towards Practical Deletion Repair of Inconsistent DL-programs
نویسندگان
چکیده
Nonmonotonic Description Logic (DL-) programs couple nonmonotonic logic programs with DL-ontologies through queries in a loose way which may lead to inconsistency, i.e., lack of an answer set. Recently defined repair answer sets remedy this but a straightforward computation method lacks practicality. We present a novel evaluation algorithm for deletion repair answer sets based on support sets, which reduces evaluation of DL-LiteA ontology queries to constraint matching. This leads to significant performance gains towards inconsistency management in practice.
منابع مشابه
Computing Repairs for Inconsistent DL-programs over EL Ontologies
DL-programs couple nonmonotonic logic programs with DL-ontologies through queries in a loose way which may lead to inconsistency, i.e., lack of an answer set. Recently defined repair answer sets remedy this. In particular, for DL-LiteA ontologies, the computation of deletion repair answer sets can effectively be reduced to constraint matching based on so-called support sets. Here we consider th...
متن کاملRepairs of Inconsistent DL - programs over EL Ontologies ∗
Description Logic (DL) ontologies and non-monotonic rules are two prominent Knowledge Representation (KR) formalisms with complementary features, essential for various applications. A natural idea of getting the best out of two worlds by combining them led to Nonmonotonic Description Logic (DL) programs, which are a powerful approach that supports rule-based reasoning on top of DL ontologies, u...
متن کاملQuery-Driven Repairing of Inconsistent DL-Lite Knowledge Bases
We consider the problem of query-driven repairing of inconsistent DL-Lite knowledge bases: query answers are computed under inconsistency-tolerant semantics, and the user provides feedback about which answers are erroneous or missing. The aim is to find a set of ABox modifications (deletions and additions), called a repair plan, that addresses as many of the defects as possible. After formalizi...
متن کاملComputing Repairs of Inconsistent DL-Programs over EL Ontologies
Description Logic (DL) ontologies and non-monotonic rules are two prominent Knowledge Representation (KR) formalisms with complementary features that are essential for various applications. Nonmonotonic Description Logic (DL) programs combine these formalisms thus providing support for rule-based reasoning on top of DL ontologies using a well-defined query interface represented by so-called DL-...
متن کاملTowards Tractable and Practical ABox Abduction over Inconsistent Description Logic Ontologies
ABox abduction plays an important role in reasoning over description logic (DL) ontologies. However, it does not work with inconsistent DL ontologies. To tackle this problem while achieving tractability, we generalize ABox abduction from the classical semantics to an inconsistency-tolerant semantics, namely the Intersection ABox Repair (IAR) semantics, and propose the notion of IAR-explanations...
متن کامل